منابع مشابه
Kernel-Based Information Criterion
This paper introduces Kernel-based Information Criterion (KIC) for model selection in regression analysis. The kernel-based complexity measure in KIC efficiently computes the interdependency between parameters of the model using a novel variable-wise variance and yields selection of better, more robust regressors. Experimental results show superior performance on both simulated and real data se...
متن کاملISAR Image Improvement Using STFT Kernel Width Optimization Based On Minimum Entropy Criterion
Nowadays, Radar systems have many applications and radar imaging is one of the most important of these applications. Inverse Synthetic Aperture Radar (ISAR) is used to form an image from moving targets. Conventional methods use Fourier transform to retrieve Doppler information. However, because of maneuvering of the target, the Doppler spectrum becomes time-varying and the image is blurred. Joi...
متن کاملKernel-based feature extraction under maximum margin criterion
In this paper, we study the problem of feature extraction for pattern classification applications. RELIEF is considered as one of the best-performed algorithms for assessing the quality of features for pattern classification. Its extension, local feature extraction (LFE), was proposed recently and was shown to outperform RELIEF. In this paper, we extend LFE to the nonlinear case, and develop a ...
متن کاملSpeaker Clustering Based on Bayesian Information Criterion
This paper presents an effective method for clustering unknown speech utterances based on their associated speakers. The proposed method jointly optimizes the generated clusters and the number of clusters according to a Bayesian information criterion (BIC). The criterion assesses a partitioning of utterances based on how high the level of withincluster homogeneity can be achieved at the expense...
متن کاملSmooth Boosting Using an Information-Based Criterion
Smooth boosting algorithms are variants of boosting methods which handle only smooth distributions on the data. They are proved to be noise-tolerant and can be used in the “boosting by filtering” scheme, which is suitable for learning over huge data. However, current smooth boosting algorithms have rooms for improvements: Among non-smooth boosting algorithms, real AdaBoost or InfoBoost, can per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer and Information Science
سال: 2015
ISSN: 1913-8997,1913-8989
DOI: 10.5539/cis.v8n1p10